A reduced-complexity algorithm for combined equalization and decoding
نویسندگان
چکیده
منابع مشابه
A reduced-complexity algorithm for combined equalization and decoding
This paper presents a new application of a suboptimal trellis decoding algorithm for combined equalization and decoding. The proposed algorithm can outperform the reduced-state sequence estimator (RSSE) of the same order of complexity. The algorithm, termed estimated future decision-feedback algorithm (EFDFA), was originally proposed for the problem of noncoherent decoding with multiple-symbol ...
متن کاملA Novel Reduced Complexity Forward-Backward Equalization Algorithm
The complexity of channel equalization using the BCJR algorithm grows exponentially with the channel memory and signal cardinality. In this paper we present a novel reduced complexity equalization algorithm where independent forward and backward trellises are formed based on decision feedback sequence estimation (DFSE) idea. Performance of the new equalizer algorithm is evaluated for turbo equa...
متن کاملA Reduced-complexity Ldpc Decoding Algorithm with Chebyshev Polynomial Fitting
BP decoding algorithm is a high-performance low-density parity-check (LDPC) code decoding algorithm, but because of its high complexity, it can’t be applied to the high-speed communications systems. So in order to further reduce the implementation complexity with the minimum affection to the system performance, , we proposed a BP algorithm based on Chebyshev polynomial fitting for its good appr...
متن کاملCombined Blind Equalization and Turbo Decoding
A b d m c t We describe parallel concatenated codes for, communication in the presence of intersymbol interference (ISI). Two iterative decoder structures which combine channel equalization and turbo decoding are presented. The first one combines the trellis representing each one of the constituent encoders with the IS1 trellis and performs slightly better that the second structure, which treat...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2000
ISSN: 0090-6778
DOI: 10.1109/26.886470